Model checking strategy-controlled systems in rewriting logic

Symbolic Model Checking Epistemic Strategy Logic

This paper presents a symbolic BDD-based model checking algorithm for an epistemic strategy logic with observational semantics. The logic has been shown to be more expressive than several variants of ATEL and therefore the algorithm can also be used for ATEL model checking. We implement the algorithm in a model checker and apply it to an application on train control system. The performance of t...

Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae

A factor in the complexity of conventional algorithms for model checking Computation Tree Logic (CTL) is the size of the formulae, and, more precisely, the number of fixpoint operators. This paper addresses the following questions: given a CTL formula f , is there an equivalent formula with fewer fixpoint operators? and how term rewriting techniques may be used to find it? Moreover, for some su...

Model Checking Using Tabled Rewriting

LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled rewriting). It can utilize the history of computation to eliminate the redundant work in the process of reducing terms to their normalized forms. However the practicality of using LRR as a framework for implementing mod...

Model-Checking Infinite Systems Generated by Ground Tree Rewriting

Model Checking Cooperative Multi-agent Systems in BDI Logic

Traditional temporal logics such as LTL (Linear Temporal Logic) and CTL (Computation Tree Logic) have shown tremendous success in specifying and verifying hardware and software systems. However, this kind of logic can only model the dynamic behaviors for a single system, and fall short in capturing the joint and concurrent aspects in the composition of systems, such as the interactions and coor...